Technical Note—A Note on Linearly Decreasing, Delay-Dependent Non-Preemptive Queue Disciplines

On Finite Queue with Two Types of Failures and Preemptive Priority (RESEARCH NOTE)

We study the single server queueing system with two types of Abstract failure to servicechannels including the preemptive priority to the repair of major failure. The units arrive at thesystem in a poisson fashion and are served exponenitally. The steady - state probabilities ofvarious states by using generating function have been obtained.

Controllable Multi-Server Queue with Balking (TECHNICAL NOTE)

Optimization of M G 1 Queue with Vacation (TECHNICAL NOTE)

This paper reports on the minimization of the average waiting time of the customers in the M/G/1 queue with vacation. Explicit formula for the unknown service parameter of a particular customer has been obtained by considering the exhaustive service discipline in the case of multi-user with unlimited service system. Moreover, results in case of partially gated and gated service disciplines unde...

Delay Analysis of a Discrete-Time Non-Preemptive Priority Queue with Priority Jumps

In this paper, we consider a discrete-time non-preemptive priority queueing model with priority jumps. Two classes, real-time (high priority) and non-real time (low priority), of traffic will be considered with providing jumps from lower priority traffic to the queue of high priority traffic. We derive expressions for the joint probability generating function of the system contents of the high ...

Auction-Based Queue Disciplines

Each one of several impatient agents has a job that needs to be processed by a server. The server can process the jobs sequentially, one at a time. Agents are privately informed about the realization of a random variable representing processing time. If the cost of delay is represented by a concave function of waiting time till job completion, the efficient shortest processing time first schedu...